Robust visual hashing via ICA

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RHash: Robust Hashing via `∞-norm Distortion

Hashing is an important tool in large-scale machine learning. Unfortunately, current data-dependent hashing algorithms are not robust to small perturbations of the data points, which degrades the performance of nearest neighbor (NN) search. The culprit is the minimization of the `2-norm, average distortion among pairs of points to find the hash function. Inspired by recent progress in robust op...

متن کامل

Geometric Invariant Robust Image Hashing Via Zernike Moment

Robust image hashing methods require the robustness to content preserving processing and geometric transform. Zernike moment is a local image feature descriptor whose magnitude components are rotationally invariant and most suitable for image hashing application. In this paper, we proposed Geometric invariant robust image hashing via zernike momment. Normalized zernike moments of an image are u...

متن کامل

Robust Image Hashing

The proliferation of digital images creates problems for managing large image databases, indexing individual images, and protecting intellectual property. This paper introduces a novel image indexing technique that may be called an image hash function. The algorithm uses randomized signal processing strategies for a non-reversible compression of images into random binary strings, and is shown t...

متن کامل

Fast Robust Hashing

As stateful flow-aware services are becoming commonplace, distributed router architectures have to quickly assign packets being forwarded to service-specialized processors in order to balance flow processing and state among them. Moreover, packets belonging to the same flow must be always assigned to the same CPU, even if some of the service processors become unavailable. This paper presents tw...

متن کامل

Robust Visual Tracking via Coupled Randomness

Tracking algorithms for arbitrary objects are widely researched in the field of computer vision. At the beginning, an initialized bounding box is given as the input. After that, the algorithms are required to track the objective in the later frames on-the-fly. Tracking-by-detection is one of the main research branches of online tracking. However, there still exist two issues in order to improve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2010

ISSN: 1742-6596

DOI: 10.1088/1742-6596/206/1/012035